On input-revolving deterministic and nondeterministic finite automata
نویسندگان
چکیده
منابع مشابه
More on Deterministic and Nondeterministic Finite Cover Automata - Extended Abstract
Finite languages are an important sub-regular language family, which were intensively studied during the last two decades in particular from a descriptional complexity perspective. An important contribution to the theory of finite languages are the deterministic and the recently introduced nondeterministic finite cover automata (DFCAs and NFCAs, respectively) as an alternative representation of...
متن کاملNondeterministic Finite Automata
This is an example of what is called a nondeterministic finite automaton (NFA). Intuitvely, such a machine could have many possible computations on a given input. For example, on an input of the form u001v, it is possible for the machine to reach the accepting state qp by transitioning from q to q0 after reading u. Similarly, it is possible for the machine to reach qp also on the input u01v — f...
متن کاملEquivalence of Deterministic and Nondeterministic Epsilon Automata
For simplicity, we adopt the following convention: x, y, X denote sets, E denotes a non empty set, e denotes an element of E, u, u1, v, v1, v2, w denote elements of Eω, F denotes a subset of Eω, i, k, l denote natural numbers, T denotes a non empty transition-system over F , and S, T denote subsets of T. One can prove the following propositions: (1) If i ≥ k + l, then i ≥ k. (2) For all finite ...
متن کاملOn the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
We investigate the succinctness of several kinds of unary automata by studying their state complexity in accepting the family {Lm} of cyclic languages, where Lm = {a | k ∈ N}. In particular, we show that, for any m, the number of states necessary and sufficient for accepting the unary language Lm with isolated cut point on one-way probabilistic finite automata is p1 1 +p α2 2 + · · ·+ps s , wit...
متن کاملSimplifying Nondeterministic Finite Cover Automata
The concept of Deterministic Finite Cover Automata (DFCA) was introduced at WIA ’98, as a more compact representation than Deterministic Finite Automata (DFA) for finite languages. In some cases representing a finite language, Nondeterministic Finite Automata (NFA) may significantly reduce the number of states used. The combined power of the succinctness of the representation of finite language...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2009
ISSN: 0890-5401
DOI: 10.1016/j.ic.2009.03.002